A combined multistart-annealing algorithm for continuous global optimization
نویسندگان
چکیده
منابع مشابه
Multistart Algorithm for Global Optimization
Abtstract A generalization of the multistart algorithm is proposed for nding the global minimizer of a nonlinear function of n variables. Our method concentrates a quasirandom sample by performing a few inexpensive local searches. The sample is then reduced by replacing worse points by new quasirandom points. A complete local search is performed only on those points with small function values. ...
متن کاملParallel Continuous Simulated Annealing for Global Optimization
In this paper a parallel algorithm for simulated annealing (S.A.) in the continuous case, the Multiple Trials and Adaptive Supplementary Search, MTASS algorithm, is presented. It is based on a combination of multiple trials, local improved searchs and an adaptive cooling schedule. The results in optimizing some standard test problems are compared with a sequential S.A. algorithms and another pa...
متن کاملA fast annealing evolutionary algorithm for global optimization
By combining the aspect of population in genetic algorithms (GAs) and the simulated annealing algorithm (SAA), a novel algorithm, called fast annealing evolutionary algorithm (FAEA), is proposed. The algorithm is similar to the annealing evolutionary algorithm (AEA), and a very fast annealing technique is adopted for the annealing procedure. By an application of the algorithm to the optimizatio...
متن کاملA Derivative-Free Filter Driven Multistart Technique for Global Optimization
A stochastic global optimization method based on a multistart strategy and a derivative-free filter local search for general constrained optimization is presented and analyzed. In the local search procedure, approximate descent directions for the constraint violation or the objective function are used to progress towards the optimal solution. The algorithm is able to locate all the local minima...
متن کاملSimulated Annealing Algorithms for Continuous Global Optimization: Convergence Conditions
In this paper, simulated annealing algorithms for continuous global optimization are considered. After a review of recent convergence results from the literature, a class of algorithms is presented for which strong convergence results can be proved without introducing assumptions which are too restrictive. The main idea of the paper is that of relating both the temperature value and the support...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1991
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90171-y